Efficient Lossy Compression for Scientific Data Based on Pointwise Relative Error Bound
نویسندگان
چکیده
منابع مشابه
Pointwise redundancy in lossy data compression and universal lossy data compression
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed distortion level. “Pointwise redundancy” refers to the difference between the description length achieved by an nth-order block code and the optimal nR(D) bits. For memoryless sources, we show that the best achievable redundancy rate is of order O( √ n) in probability. This follows from a second-orde...
متن کاملLossy Compression of Scientific Data with Wavelet Transforms
Scientific data gathered from simulation or real measurement usually requires 64 bit floating point numbers to retain accuracy. Unfortunately, these numbers do not lend themselves to traditional compression techniques, such as run-length encoding used in most general compression schemes. A different approach is to recognize that a reversible signal transformation can encode the information usin...
متن کاملStatistical mechanical approach to error exponents of lossy data compression
We provide a scheme by which to accurately evaluate the error exponents of a lossy data compression problem, which characterize average probabilities over a code ensemble of compression failure and success above and below a critical compression rate, respectively, utilizing the replica method (RM). Although the existing method used in information theory (IT) is, in practice, limited to only ens...
متن کاملInduced Redundancy based Lossy Data Compression Algorithm
A Wireless Sensor Network (WSN) is an increasingly important mechanism for enabling continuous monitoring and sensing of physical variables like temperature, humidity etc. The tiny sensor nodes are powered by low capacity batteries. As the WSNs are usually deployed in remote areas, battery replacement becomes difficult. To minimize the power consumption in WSN, the data compression schemes play...
متن کاملLarge-scale Lossy Data Compression Based on an A
4 I/O is becoming an increasing bottleneck on large-scale computer systems. We present a highly 5 scalable lossy data compression algorithm with controllable committed error based on an a priori 6 estimator. The scientific data field is compacted via the discrete Chebyshev transform (DCT), 7 truncated at a level within a user-specified tolerance, and subsequently compressed before writing to 8 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2019
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2018.2859932